Lambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
نویسنده
چکیده
Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are non-negative integers and 1 < θ < 2. Lambda words are right-infinite words defined over an infinite alphabet that have connections with Sturmian words, Christoffel words, and interspersion arrays. We show that Lambda words are infinite rich words. Furthermore, any Lambda word may be mapped onto a right-infinite word over a three-letter alphabet. Although the mapping preserves palindromes and non-palindromes of the Lambda word, the resulting Gamma word is not rich.
منابع مشابه
On the Unavoidability of k-Abelian Squares in Pure Morphic Words
We consider a recently defined notion of k-abelian equivalence of words by concentrating on avoidability problems. The equivalence class of a word depends on the number of occurrences of different factors of length k for a fixed natural number k and the prefix of the word. We show that over a ternary alphabet, k-abelian squares cannot be avoided in pure morphic words for any natural number k. N...
متن کاملGeneralized trapezoidal words
The factor complexity function C w (n) of a finite or infinite word w counts the number of distinct factors of w of length n for each n ≥ 0. A finite word w of length |w| is said to be trapezoidal if the graph of its factor complexity C w (n) as a function of n (for 0 ≤ n ≤ |w|) is that of a regular trapezoid (or possibly an isosceles triangle); that is, C w (n) increases by 1 with each n on so...
متن کاملAn Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations. We also consider a slight extension of the Feferman-Vaught formalism which allows to express more relations between component values (such as equa...
متن کاملVertical representation of C∞-words
We present a new framework for studying C∞-words, that are arbitrarily many times differentiable words over the alphabet Σ = {1,2}. After introducing an equivalence relation on C∞-words, whose classes are called minimal classes and represent all the C∞-words, we define a vertical coding of these words based on a three-letter alphabet, and a set of functions operating over this representation. W...
متن کاملA generalization of Thue freeness for partial words
This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of “holes.” First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-lett...
متن کامل